Compound Poisson approximation of word counts in DNA sequences

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compound Poisson process approximation

Compound Poisson processes are often useful as approximate models, when describing the occurrence of rare events. In this paper, we develop a method for showing how close such approximations are. Our approach is to use Stein's method directly, rather than by way of declumping and a marked Poisson process; this has conceptual advantages, but entails technical difficulties. Several applications a...

متن کامل

Poisson approximation for search of rare words in DNA sequences

Using recent results on the occurrence times of a string of symbols in a stochastic process with mixing properties, we present a new method for the search of rare words in biological sequences generally modelled by a Markov chain. We obtain a bound on the error between the distribution of the number of occurrences of a word in a sequence (under a Markov model) and its Poisson approximation. A g...

متن کامل

A Compound Poisson Approximation Inequality

We give conditions under which the number of events which occur in a sequence of m-dependent events is stochastically smaller than a suitably defined compound Poisson random variable. The results are applied to counts of sequence pattern appearances and to system reliability. We also provide a numerical example.

متن کامل

Approximation of word counts in Markov chains

In this talk, we give an overview about the diierent approximation results existing on the statistical distribution of word counts in a Markov chain. Results concerning the number of overlapping occurrences, the number of non-overlapping occurrences (renewals) and the declumped count will be presented. Counts of single words but also multiple words and word families are considered. We will see ...

متن کامل

Compound Poisson approximations of subgraph counts in random graphs

Poisson approximation, random graphs, Stein's method Poisson approximations for the counts of a given subgraph in large random graphs were accomplished using Stein's method by Barbour and others. Compound Poisson approximation results, on the other hand, have not appeared, at least partly because of the lack of a suitable coupling. We address that problem by introducing the concept of cluster d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ESAIM: Probability and Statistics

سال: 1997

ISSN: 1292-8100,1262-3318

DOI: 10.1051/ps:1997100